|
|
Use of a simulation model for the development of an automatic algorithm for creating a routing table and path evaluation in a conveyor system
Weyrová, Dominika ; Simeonov, Simeon (referee) ; Hromková, Ivana (advisor)
The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.
|
|
|
Preparation of Homeworks in the Course Algorithms
Vrábelová, Pavla ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
This bachelor's thesis deals with a new set of exercises for a subject Algorithms. There are explained terms such as algorithm and complexity, described general properties and types of algorithms. Further, particular sort and search algorithms covered in the set of exercises are described in more details. There is explained how these algorithms work, described their complexity, category, field of use, advantages and disadvantages. Next part presents principles of a system for automated generation and rating of exercises. The implementation of particular parts of system is described in the last chapter of this paper.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
Use of a simulation model for the development of an automatic algorithm for creating a routing table and path evaluation in a conveyor system
Weyrová, Dominika ; Simeonov, Simeon (referee) ; Hromková, Ivana (advisor)
The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.
|
|
|
Framework for development of optimization algorithms
Hurt, Tomáš ; Trunda, Otakar (advisor) ; Hric, Jan (referee)
The aim of the thesis is to design and implement an efficient tool for research and testing of algorithms of the combinatorial optimization. The domain of the planning research will be explained and the steps of design and implementation of such program will be covered. The framework will support two primary for- malisms for the description of optimization problems (PDDL, SAS+ ). The inputs processing will be provided, suitable data structures and efficient implementati- ons of search algorithms will also be included. The emphasis will be on a proper object design and easy extensibility for the future development. To achieve this goal, proven principles of software engineering will be used. 1
|
|
|
Preparation of Homeworks in the Course Algorithms
Vrábelová, Pavla ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
This bachelor's thesis deals with a new set of exercises for a subject Algorithms. There are explained terms such as algorithm and complexity, described general properties and types of algorithms. Further, particular sort and search algorithms covered in the set of exercises are described in more details. There is explained how these algorithms work, described their complexity, category, field of use, advantages and disadvantages. Next part presents principles of a system for automated generation and rating of exercises. The implementation of particular parts of system is described in the last chapter of this paper.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
guest ::
